DPU: DAG Processing Unit for Irregular Graphs With Precision-Scalable Posit Arithmetic in 28 nm
نویسندگان
چکیده
Computation in several real-world applications like probabilistic machine learning, sparse linear algebra, and robotic navigation, can be modeled as irregular directed acyclic graphs (DAGs). The data dependencies DAGs pose challenges to parallel execution on general-purpose CPUs GPUs, resulting severe under-utilization of the hardware. This paper proposes DPU, a specialized processor designed for efficient DAGs. DPU is equipped with compute units that execute different subgraphs DAG independently. synchronize within cycle using hardware-supported synchronization primitive, communicate via an interconnect global banked scratchpad. Furthermore, precision-scalable posit arithmetic unit developed enable application-dependent precision. taped-out 28nm CMOS, achieving speedup 5.1$\times$ 20.6$\times$ over state-of-the-art CPU GPU implementations algebra learning workloads. performance achieved while operating at power budget 0.23W, opposed 55W 98W GPU, peak efficiency 538 GOPS/W which 1350$\times$ 9000$\times$ higher than respectively. Thus, architecture, enables low-power
منابع مشابه
Neighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملMSB-First Interval-Bounded Variable-Precision Real- Time Arithmetic Unit
This paper presents a paradigm of real-time processing on the lowest level of computing systems: the arithmetic unit. The arithmetic unit based on this principle containing addition, subtraction, multiplication and division operations is described. The development of the computation model is based on the Soft Computing and the Imprecise Computation paradigms, combined with the MSBFirst and the ...
متن کاملneighbourly irregular derived graphs
a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملProposal for a High Precision Tensor Processing Unit
This whitepaper proposes the design and adoption of a new generation of Tensor Processing Unit (TPU) which has the performance of Google’s TPU, yet performs operations on wide precision data. The new generation TPU is made possible by implementing arithmetic circuits which compute using a new general purpose, fractional arithmetic based on the residue number system (RNS). www.digitalsystemresea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Solid-state Circuits
سال: 2022
ISSN: ['0018-9200', '1558-173X']
DOI: https://doi.org/10.1109/jssc.2021.3134897